#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;

template<class T>
class comp
{
	bool operator()(T& x, T& y)
	{
		return x > y;
	}
};
int main()
{
	vector<int> v = { 0, 2, 3, 6 };
	sort(v.begin(), v.end(),comp<int>());

	//priority_queue<int> qt(v.begin(),v.end(),comp<int>());


	return 0;
}